Nuprl Lemma : strict-fun-connected_wf
11,40
postcript
pdf
T
:Type,
f
:(
T
T
),
x
,
y
:
T
.
y
=
f
+(
x
)
latex
Definitions
Type
,
t
T
,
s
=
t
,
x
:
A
B
(
x
)
,
x
:
A
.
B
(
x
)
,
y
is
f
*(
x
)
,
,
A
,
x
:
A
B
(
x
)
,
P
&
Q
,
y
=
f
+(
x
)
Lemmas
not
wf
,
fun-connected
wf
origin
T:Type, f:(T
T), x, y:T. y = f+(x) 
T:Type, f:(TT), x, y:T. y = f+(x) TB(x)x:A. B(x)
A
B(x)